A Versatile Time-Domain Reed-Solomon Decoder
نویسندگان
چکیده
A versatile Reed-Solomon (RS) decoder structure is developed based on the time-domain decoding algorithm (transform decoding without transforms). In this paper, the algorithm is restructured and a method is given to decode any RS code generated by any generator polynomial. The main advantage of the introduced decoder structure is the versatility. By versatile decoder we mean a decoder that can be programmed to decode any Reed-Solomon code defined in Galois field 2'" with a fixed symbol size m. This decoder can correct both errors and erasures for any RS code including shortened and singly extended codes. It is shown that the introduced versatile decoder has a very simple structure and can be used to design high-speed singlechip VLSI decoders. As an illustrative example, a Gate-Array-Based programmable RS decoder is implemented on a single chip. This decoder chip can decode any RS code defined in GF (2') with any code word length and any number of information symbols. The decoder chip is fabricated using low power, 1.5 1, 2-layer metal, HCMOS technol-
منابع مشابه
A Cellular Structure for a Versatile Reed-Solomon Decoder
A new cellular structure for a versatile Reed-Solomon (RS) decoder is introduced based on time domain decoding algorithm. The time domain decoding algorithm is restructured to be suitable for introducing the cellular structure. The main advantages of this structure are its versatility and very simple cellular structure. By versatile decoder we mean a decoder that can be programmed to decode any...
متن کاملFast Transform for Decoding Both Errors and Erasures of Reed – Solomon Codes Over GF ( 2 m ) for 8 m 10
In this letter, it is shown that a fast, prime-factor discrete Fourier transform (DFT) algorithm can be modified to compute Fourier-like transforms of long sequences of 2 1 points over GF(2 ), where 8 10. Using these transforms, together with the Berlekamp–Massey algorithm, the complexity of the transform-domain decoder for correcting both errors and erasures of the Reed–Solomon codes of block ...
متن کاملOn the VLSI Design of a Pipeline Reed-Solomon Decoder Using Systolic Arrays
A new VLSI design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorpora...
متن کاملOn the VLSI Design of a Pipeline Reed-Solomon Decoder Using Systolic Arrays
A new VLSI design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorpora...
متن کاملModified time-domain algorithm for decoding Reed-Solomon codes
PRIMITIVE RS(n, k ) code with symbols from GF(2") A has codewords of length n = 2" 1. These codes can correct t = (n k)/2 symbol errors, with k information symbols. Time-domain decoding algorithms are attractive candidates for designing universal hardware RS decoders [l], [2 ] . A universal decoder can be used to decode any RS code with any block length and symbol alphabet, up to the limits of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Journal on Selected Areas in Communications
دوره 8 شماره
صفحات -
تاریخ انتشار 1990